New Fast Algorithms for First-Order Linear Recurrences on Vector Computers
نویسندگان
چکیده
We examine the performance of parallel algorithms for rst-order linear recurrence on vector computers, evaluate them quantitatively on a simple model of vector computers, and propose new fast algorithms. We also show a result of performance benchmarking of them on actual vector computers.
منابع مشابه
Scalable Techniques for Computing Band Linear Recurrences on Massively Parallel and Vector Supercomputers
In this paper, we present a new scalable algorithm, called the Regular Schedule, for parallel evaluation of band linear recurrences (BLR's, i.e., mth-order linear recurrences for m 1). Its scalability and simplicity make it well suited for vector supercomputers and massively parallel computers. We describe our implementation of the Regular Schedule on two types of machines: the Convex C240 and ...
متن کاملThe Non-Symmetric s-Step Lanczos Algorithm: Derivation Of Efficient Recurrences And Synchronization-Reducing Variants Of BiCG And QMR
The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG) and quasi-minimal residual (QMR) methods for solving large sparse non-symmetric systems of linear equations. It is well known that, when implemented on dist...
متن کاملNew split algorithms for linear least squares prediction filters with linear phase
This paper is concerned with the development of new split algorithms for the design of linear least squares prediction filters with linear phase. The proposed fast algorithm, which fully expresses the inherent symmetry of the problem, requires lower computational complexity than other existing ones. Moreover, unlike other existing ones, the new recurrences involve only the order updates, which ...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملModeling and design of a diagnostic and screening algorithm based on hybrid feature selection-enabled linear support vector machine classification
Background: In the current study, a hybrid feature selection approach involving filter and wrapper methods is applied to some bioscience databases with various records, attributes and classes; hence, this strategy enjoys the advantages of both methods such as fast execution, generality, and accuracy. The purpose is diagnosing of the disease status and estimating of the patient survival. Method...
متن کامل